منابع مشابه
Diagram Chasing in Abelian Categories
In applications of the theory of homological algebra, results such as the Five Lemma are crucial. For abelian groups this result is proved by diagram chasing, a procedure not immediately available in a general abelian category. However, we can still prove the desired results by embedding our abelian category in the category of abelian groups. All of this material is taken from Mitchell’s book o...
متن کاملChasing the ghost: recovering empty categories in the Chinese Treebank
Empty categories represent an important source of information in syntactic parses annotated in the generative linguistic tradition, but empty category recovery has only started to receive serious attention until very recently, after substantial progress in statistical parsing. This paper describes a unified framework in recovering empty categories in the Chinese Treebank. Our results show that ...
متن کاملModel Categories of Diagram Spectra
1. Preliminaries about topological model categories 5 2. Preliminaries about equivalences of model categories 9 3. The level model structure on D-spaces 10 4. Preliminaries about π∗-isomorphisms of prespectra 14 5. Stable weak equivalences of D-spectra 18 6. The stable model structure on D-spectra 23 7. Comparisons among P , ΣS , IS , and W T 27 8. Model categories of ring and module spectra 30...
متن کاملMalcev Dialgebras
We apply Kolesnikov’s algorithm to obtain a variety of nonassociative algebras defined by right anticommutativity and a “noncommutative” version of the Malcev identity. We use computational linear algebra to verify that these identities are equivalent to the identities of degree ≤ 4 satisfied by the dicommutator in every alternative dialgebra. We extend these computations to show that any speci...
متن کاملMalcev Algebras and Combinatorial Structures
In this work, we design an algorithmic method to associate combinatorial structures with finite-dimensional Malcev algebras. In addition to its theoretical study, we have performed the implementation of procedures to construct the digraph associated with a given Malcev algebra (if its associated combinatorial structure is a digraph) and, conversely, a second procedure to test if a given digraph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1991
ISSN: 0022-4049
DOI: 10.1016/0022-4049(91)90022-t